|
In theoretical computer science, and specifically computational complexity theory and circuit complexity, TC is a complexity class, and TCi is a hierarchy of complexity classes. Each class TCi consists of the languages recognized by Boolean circuits with depth and a polynomial number of unlimited-fanin AND, OR gates and Majority gates. The class TC is defined as : ==Relation to NC and AC== The relationship between the TC, NC and the AC hierarchy can be summarized as : In particular, we know that : The first strict containment follows from the fact that NC0 cannot compute any function that depends on all the input bits. Thus choosing a problem that is trivially in AC0 and depends on all bits separates the two classes. (For example, consider the OR function.) The strict containment AC0 ⊊ TC0 follows because parity and majority (which are both in TC0) were shown to be not in AC0.〔M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. ''Math. Systems Theory'', 17:13–27, 1984.〕 As an immediate consequence of the above containments, we have that NC = AC = TC. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「TC (complexity)」の詳細全文を読む スポンサード リンク
|